Temporal network embedding using graph attention network
نویسندگان
چکیده
Abstract Graph convolutional network (GCN) has made remarkable progress in learning good representations from graph-structured data. The layer-wise propagation rule of conventional GCN is designed such a way that the feature aggregation at each node depends on features one-hop neighbouring nodes. Adding an attention layer over can allow to provide different importance within various neighbours. These methods capture properties static network, but not well suited temporal patterns time-varying networks. In this work, we propose graph (TempGAN), where aim learn continuous-time by preserving proximity between nodes network. First, perform walk generate positive pointwise mutual information matrix (PPMI) which denote correlation Furthermore, design TempGAN architecture uses both adjacency and PPMI embeddings Finally, conduct link prediction experiments designing autoencoder evaluate quality embedding generated, results are compared with other state-of-the-art methods.
منابع مشابه
Link Prediction using Network Embedding based on Global Similarity
Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...
متن کاملAlgorithms for services and network resources allocation using graph embedding
Technologies for current distributed applications, such as Grids , already support sharing and coordinated use of various resources located in resource-end systems. Optimized services network operators would use the connectivity provided by high-speed networks. Indeed, virtualizing the set of computing and communication resources in order to place professional users into a collaborative working...
متن کاملassessment of the efficiency of s.p.g.c refineries using network dea
data envelopment analysis (dea) is a powerful tool for measuring relative efficiency of organizational units referred to as decision making units (dmus). in most cases dmus have network structures with internal linking activities. traditional dea models, however, consider dmus as black boxes with no regard to their linking activities and therefore do not provide decision makers with the reasons...
AAANE: Attention-based Adversarial Autoencoder for Multi-scale Network Embedding
Network embedding represents nodes in a continuous vector space and preserves structure information from the Network. Existing methods usually adopt a “one-size-fits-all” approach when concerning multi-scale structure information, such as firstand second-order proximity of nodes, ignoring the fact that different scales play different roles in the embedding learning. In this paper, we propose an...
متن کاملGraph Embedding with Rich Information through Bipartite Heterogeneous Network
Graph embedding has attracted increasing attention due to its critical application in social network analysis. Most existing algorithms for graph embedding only rely on the typology information and fail to use the copious information in nodes as well as edges. As a result, their performance for many tasks may not be satisfactory. In this paper, we proposed a novel and general framework of repre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complex & Intelligent Systems
سال: 2021
ISSN: ['2198-6053', '2199-4536']
DOI: https://doi.org/10.1007/s40747-021-00332-x